Improved complexity results for the robust mean absolute deviation problem on networks with linear vertex weights
نویسندگان
چکیده
In a recent paper [10], an algorithmic approach was presented for the robust (minmax regret) absolute deviation location problem on networks with vertex weights which are linear functions of an uncertain or dynamically changing parameter. In this paper, we present algorithmic and analytical improvements that significantly reduce the computational complexity bounds for the algorithm.
منابع مشابه
Robust uncapacitated multiple allocation hub location problem under demand uncertainty: minimization of cost deviations
The hub location–allocation problem under uncertainty is a real-world task arising in the areas such as public and freight transportation and telecommunication systems. In many applications, the demand is considered as inexact because of the forecasting inaccuracies or human’s unpredictability. This study addresses the robust uncapacitated multiple allocation hub location problem with a set of ...
متن کاملRobust location problems with pos/neg weights on a tree
In this paper we consider diierent aspects of robust 1-median problems on a tree network with uncertain or dynamically changing edge lengths and vertex weights which can also take negative values. The dynamic nature of a parameter is modeled by a linear function of time. A linear algorithm is designed for the absolute dynamic robust 1-median problem on a tree. The dynamic robust deviation 1-med...
متن کاملThe robust vertex centdian location problem with interval vertex weights on general graphs
In this paper, the robust vertex centdian location problem with uncertain vertex weights on general graphs is studied. The used criterion to solve the problem is the min-max regret criterion. This problem is investigated with objective function contains $lambda$ and a polynomial time algorithm for the problem is presented. It is shown that the vertex centdian problem on general graphs i...
متن کاملA Robust Scenario Based Approach in an Uncertain Condition Applied to Location-Allocation Distribution Centers Problem
The paper discusses the location-allocation model for logistic networks and distribution centers through considering uncertain parameters. In real-world cases, demands and transshipment costs change over the period of the time. This may lead to large cost deviation in total cost. Scenario based robust optimization approaches are proposed where occurrence probability of each scenario is not know...
متن کاملمدل میانگین انحراف مطلق با عدم قطعیت روی بازدهها برای بهینه سازی سبد سهام
In this paper, mean absolute deviation model for optimal portfolio selection problem is studied. Due to the uncertainty in the observed returns from financial markets, an improved robust formulation based on Bertsimas and Sim approach is presented. Then we study the robust model of the problem under correlated uncertainty set and give its equivalent model. Finally, the performance of the imp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 239 شماره
صفحات -
تاریخ انتشار 2018